Monadic Printing Revisited
نویسندگان
چکیده
منابع مشابه
Monadic Fold, Monadic Build, Monadic Short Cut Fusion
Short cut fusion improves the efficiency of modularly constructed programs by eliminating intermediate data structures produced by one program component and immediately consumed by another. We define a combinator which expresses uniform production of data structures in monadic contexts, and is the natural counterpart to the well-known monadic fold which consumes them. Like the monadic fold, our...
متن کاملOn Monadic NP vs. Monadic co-NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...
متن کاملOn Monadic Theories of Monadic Predicates
Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure S1 = (N,+1) of the natural numbers and the monadic theory of the binary tree, i.e., of the two-successor structure S2 = ({0, 1} ∗, ·0, ·1). We c...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملThe Complexity of First-Order and Monadic Second-Order Logic Revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic. We show that unless PTIME = NP, the model-checking problem for monadic second-order logic on finite words is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Computer Science Methods
سال: 2016
ISSN: 2391-8241
DOI: 10.1515/jacsm-2016-0005